A class of parallel nonlinear multisplitting relaxation methods for the large sparse nonlinear complementarity problems
نویسندگان
چکیده
منابع مشابه
Homotopy Continuation Methods for Nonlinear Complementarity Problems
A complementarity problem with a continuous mapping f from R n into itself can be written as the system of equations F(x, y ) = 0 and ( x , y ) > 0. Here F is the mapping from R ~ " into itself defined by F(x, y) = ( x l y ,, x 2 y Z , . . . , x , ~ y e , y f f x ) ) . Under the assumption that the mapping f is a P,,-function, we study various aspects of homotopy continuation methods that trace...
متن کاملJacobian Smoothing Methods for Nonlinear Complementarity Problems
We present a new algorithm for the solution of general (not necessarily monotone) complementarity problems. The algorithm is based on a reformulation of the complementarity problem as a nonsmooth system of equations by using the Fischer-Burmeister function. We use an idea by Chen, Qi and Sun and apply a Jacobian smoothing method (which is a mixture between nonsmooth Newton and smoothing methods...
متن کاملLagrangian Globalization Methods for Nonlinear Complementarity Problems
This paper extends the Lagrangian globalization (LG) method to the nonsmooth equation Φ(x) = 0 arising from nonlinear complementarity problems NCP and presents a descent algorithm for the LG phase. The aim of this paper is not to present a new method for solving NCP, but to find x̂ such that ‖Φ(x̂)‖ < ‖Φ(x̄)‖ when the NCP has a solution and x̄ is a stationary point but not a solution.
متن کاملSmoothing Methods for Nonlinear Complementarity Problems
In this paper, we present a new smoothing approach to solve general nonlinear complementarity problems. Under the P0 condition on the original problems, we prove some existence and convergence results . We also present an error estimate under a new and general monotonicity condition. The numerical tests confirm the efficiency of our proposed methods.
متن کاملTensor Methods for Large, Sparse Nonlinear Least Squares Problems
This paper introduces tensor methods for solving large, sparse nonlinear least squares problems where the Jacobian either is analytically available or is computed by nite diier-ence approximations. Tensor methods have been shown to have very good computational performance for small to medium-sized, dense nonlinear least squares problems. In this paper we consider the application of tensor metho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1996
ISSN: 0898-1221
DOI: 10.1016/0898-1221(96)00169-1